Labelled Transition Systems Bisimulation and Distributed Bisimulation Algebraic Characterisation of Distributed Bisimulation Weak Observations Weak Distributed Bisimulation Algebraic Characterisation of Weak Distributed Bisimulation Communication as Mutual Observation towards an Algebraic Characterisation of Weak Distributed Bisimulation with Communication Castellani
نویسندگان
چکیده
In this paper, I will describe and critically evaluate the paper Distributed Bisimulations, by Ilaria Castellani and Matthew Hennessy [5]. The aim of their paper is to generalise bisimulation equivalence for a subset of CCS to take into account the distributed nature of processes and, thus give a noninterleaving semantic theory which has many of the advantages of the interleaving theory. This theory allows concurrent processes to be distinguished from nondeterministic sequential processes and preserves more of the structure of processes. The article deals predominantly with the axiomatisation of the new equivalences.
منابع مشابه
Symbolic Bisimulation for a Higher-Order Distributed Language with Passivation!
We study the behavioural theory of a higher-order distributed calculus with private names and locations that can be passivated. For this language, we present a novel Labelled Transition System where higher-order inputs are symbolic agents that can perform a limited number of transitions, capturing the nature of passivation. Standard first-order weak bisimulation over this LTS coincides with con...
متن کاملA Characterisation of Weak Bisimulation Congruence
This paper shows that weak bisimulation congruence can be characterised as rooted weak bisimulation equivalence, even without making assumptions on the cardinality of the sets of states or actions of the processes under consideration.
متن کاملStrong, Weak and Branching Bisimulation for Transition Systems and Markov Reward Chains: A Unifying Matrix Approach
We first study labeled transition systems with explicit successful termination. We establish the notions of strong, weak, and branching bisimulation in terms of boolean matrix theory, introducing thus a novel and powerful algebraic apparatus. Next we consider Markov reward chains which are standardly presented in real matrix theory. By interpreting the obtained matrix conditions for bisimulatio...
متن کاملOn Path-Based Coalgebras and Weak Notions of Bisimulation
It is well known that the theory of coalgebras provides an abstract definition of behavioural equivalence that coincides with strong bisimulation across a wide variety of state-based systems. Unfortunately, the theory in the presence of so-called silent actions is not yet fully developed. In this paper, we give a coalgebraic characterisation of branching bisimulation in the context of labelled ...
متن کاملDeciding Bisimilarities on Distributions
Probabilistic automata (PA) are a prominent compositional concurrency model. As a way to justify property-preserving abstractions, in the last years, bisimulation relations over probability distributions have been proposed both in the strong and the weak setting. Different to the usual bisimulation relations, which are defined over states, an algorithmic treatment of these relations is inherent...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2002